On generalized bisection of $n$-simplices
نویسندگان
چکیده
منابع مشابه
On Generalized Bisection of N-Simplices
A generalized procedure of bisection of n–simplices is introduced, where the bisection point can be an (almost) arbitrary point at one of the longest edges. It is shown that nested sequences of simplices generated by successive generalized bisection converge to a singleton, and an exact bound of the convergence speed in terms of diameter reduction is given. For regular simplices, which mark the...
متن کاملOn braxtopes, a class of generalized simplices
In a d-simplex every facet is a (d−1)-simplex. We consider as generalized simplices other combinatorial classes of polytopes, all of whose facets are in the class. Cubes and multiplexes are two such classes of generalized simplices. In this paper we study a new class, braxtopes, which arise as the faces of periodically-cyclic Gale polytopes. We give a geometric construction for these polytopes ...
متن کاملGeneralized Probabilistic Bisection for Stochastic Root-Finding
We consider numerical schemes for root finding of noisy responses through generalizing the Probabilistic Bisection Algorithm (PBA) to the more practical context where the sampling distribution is unknown and location-dependent. As in standard PBA, we rely on a knowledge state for the approximate posterior of the root location. To implement the corresponding Bayesian updating, we also carry out ...
متن کاملGeneralized Bisection and a Cost Bound
Generalized Bisection and a Cost Bound By R. Baker Kearfott Abstract. The purpose of this paper is to study desirable properties of binary search algorithms for isolating all solutions to nonlinear systems of equations F( X) = 0 within a given compact domain D £ R". We devise a general framework such that any algorithm fitting into the general framework will always isolate all solutions ZeD suc...
متن کاملOn Minkowski sums of simplices
We investigate the structure of the Minkowski sum of standard simplices in R. In particular, we investigate the one-dimensional structure, the vertices, their degrees and the edges in the Minkowski sum polytope. 2000 MSC: 52B05, 52B11, 05C07.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1997
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-97-00809-0